Existence of Polyhedral Embeddings of Graphs
نویسنده
چکیده
It is proved that the decision problem about the existence of an embedding of face-width 3 of a given graph is NP-complete. A similar result is proved for some related decision problems. This solves a problem raised by Neil Robertson.
منابع مشابه
Existence of Polyhedral Embeddings of Graphs Is Np-complete
It is proved that the decision problem about existence of an embed ding of face width of a given graph is NP complete A similar result is proved for some related decision problems This solves a problem raised by Neil Robertson
متن کاملOn Polyhedral Embeddings of Cubic Graphs
Polyhedral embeddings of cubic graphs by means of certain operations are studied. It is proved that some known families of snarks have no (orientable) polyhedral embeddings. This result supports a conjecture of Grünbaum that no snark admits an orientable polyhedral embedding. This conjecture is verified for all snarks having up to 30 vertices using computer. On the other hand, for every nonorie...
متن کاملLabeling Subgraph Embeddings and Cordiality of Graphs
Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$, a vertex labeling $f : V(G)rightarrow mathbb{Z}_2$ induces an edge labeling $ f^{+} : E(G)rightarrow mathbb{Z}_2$ defined by $f^{+}(xy) = f(x) + f(y)$, for each edge $ xyin E(G)$. For each $i in mathbb{Z}_2$, let $ v_{f}(i)=|{u in V(G) : f(u) = i}|$ and $e_{f^+}(i)=|{xyin E(G) : f^{+}(xy) = i}|$. A vertex labeling $f$ of a graph $G...
متن کاملFlexibility of Polyhedral Embeddings of Graphs in Surfaces
Whitney s theorem states that connected planar graphs admit essentially unique embeddings in the plane We generalize this result to em beddings of graphs in arbitrary surfaces by showing that there is a function N N such that every connected graph admits at most g combina torially distinct embeddings of face width into surfaces whose Euler genus
متن کاملOn Chirality of Toroidal Embeddings of Polyhedral Graphs
We investigate properties of spatial graphs on the standard torus. It is known that nontrivial embeddings of planar graphs in the torus contain a nontrivial knot or a nonsplit link due to [1],[2]. Building on this and using the chirality of torus knots and links [3],[4], we prove that nontrivial embeddings of simple 3connected planar graphs in the standard torus are chiral. For the case that th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorica
دوره 21 شماره
صفحات -
تاریخ انتشار 2001